A Finite-Memory Adaptive Pattern Recognizer
نویسندگان
چکیده
منابع مشابه
Project CellNet: Evolving An Autonomous Pattern Recognizer
We describe the desire for a black box approach to pattern classification: a generic Autonomous Pattern Recognizer, which is capable of self-adapting to specific alphabets without human intervention. The CellNet software system is introduced, an evolutionary system that optimizes a set of pattern-recognizing agents relative to a provided set of features and a given pattern database. CellNet uti...
متن کاملDistribution Systems Reconfiguration Using Pattern Recognizer Neural Networks
A novel intelligent neural optimizer with two objective functions is designed for electrical distribution systems. The presented method is faster than alternative optimization methods and is comparable with the most powerful and precise ones. This optimizer is much smaller than similar neural systems. In this work, two intelligent estimators are designed, a load flow program is coded, and a spe...
متن کاملAn Adaptive Character Recognizer for Telugu Scripts Using Multiresolution Analysis, Associative Memory
The present work is an attempt to develop a commercially viable and a robust character recognizer for Telugu texts. We aim at designing a recognizer which exploits the inherent characteristics of the Telugu Script. Our proposed method uses wavelet multiresolution analysis for the purpose extracting features and associative memory model to accomplish the recognition tasks. Our system learns the ...
متن کاملPattern Recognition of Process Mean Shift using Combined ANN Recognizer
Artificial Neural Network (ANN) based model has been proposed for diagnosis of process mean shift. These are mainly generalized-based where only a single classifier was applied in the diagnosis of abnormal pattern. In this paper, we analyze the performance of a combined recognizer consisting of small-sized artificial neural networks on varying number of nodes in the hidden layer trained with Le...
متن کاملA universal finite memory source
Abs&uct-In this paper an irreducible parameterization for a finite memory source is constructed in the form of a tree machine. A universal information source for the set of finite memory sources is constructed by a predictive modification of an earlier studied algorithm-Context. It is shown that this universal source incorporates any minimal data-generating tree machine in an asymptotically opt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Systems Science and Cybernetics
سال: 1968
ISSN: 0536-1567
DOI: 10.1109/tssc.1968.300181